Fast PDA Synchronization Using Characteristic Polynomial Interpolation
نویسندگان
چکیده
Modern Personal Digital Assistant (PDA) architectures often utilize a wholesale data transfer protocol known as “slow sync” for synchronizing PDAs with Personal Computers (PCs). This approach is markedly inefficient with respect to bandwidth usage and latency, since the PDA and PC typically share many common records. We propose, analyze, and implement a novel PDA synchronization scheme (CPIsync) predicated upon recent information-theoretic research. The salient property of this scheme is that its communication complexity depends on the number of differences between the PDA and PC, and is essentially independent of the overall number of records. Moreover, our implementation shows that the computational complexity of CPIsync is practical, and that the overall latency is typically much smaller than that of slow sync. Thus, CPIsync has potential for significantly improving synchronization protocols for PDAs and, more generally, for heterogeneous networks of many machines.
منابع مشابه
Data Synchronization in Mobile and Distributed Networks
The rapid increase in networked mobile devices has made it important to develop scalable data synchronization protocols that will periodically synchronize data held on these devices. Synchronization seeks to maintain consistency in data that is being changed on each of these mobile hosts independently. This has to be achieved within practical constraints on overhead that limit the amount of dat...
متن کاملFast PDA Synchronization Using Characteristic Polynomial Interpolationy
Modern Personal Digital Assistant (PDA) architectures often use a wholesale data transfer protocol known as “slow sync” for synchronizing PDAs with Personal Computers (PCs). This approach is markedly inefficient, in terms of bandwidth usage and latency, since the PDA and PC typically share many common records. We propose, analyze, and implement a novel PDA synchronization scheme (CPIsync) based...
متن کاملEfficient Synchronization of Multiple Databases over Broadcast Networks
This work deals with the problem of synchronizing multiple distributed databases over a broadcast network, such as satellite networks. The proposed method is based on introducing network coding techniques besides extending the well-known database reconciliation algorithm, the characteristic polynomial interpolation-based synchronization (CPISync). One key element is to elect a master node that ...
متن کاملSynchronization and Multipath Delay Estimation Algorithms for Digital Receivers
In this contribution, we extend the polynomial-based ML approach derived earlier for synchronization purposes to the non-data-aided (NDA) case. We propose a fully digitally implemented synchronization concept using interpolation for jointly estimating the timing and phase. The interpolation methods used in this context can be implemented using the so-called Farrow structure. The ML function is ...
متن کاملSparse Polynomial Interpolation and the Fast Euclidean Algorithm
We introduce an algorithm to interpolate sparse multivariate polynomials with integer coefficients. Our algorithm modifies Ben-Or and Tiwari’s deterministic algorithm for interpolating over rings of characteristic zero to work modulo p, a smooth prime of our choice. We present benchmarks comparing our algorithm to Zippel’s probabilistic sparse interpolation algorithm, demonstrating that our alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002